Discrete Actions in Information-Constrained Decision Problems
نویسندگان
چکیده
منابع مشابه
Discrete Actions in Information-constrained Tracking Problems
Optimal actions of an agent facing a Shannon capacity constraint on the translation of an uncertain signal into an action can easily turn out to be discretely distributed, even when the objective function and the initial distribution of uncertainty contain no discrete elements. We show this result analytically in a broad class of cases. It has implications for the interpretation of observed int...
متن کاملInformation-Constrained Discrete Choice∗
It is not unusual in real-life that one has to choose among finitely many alternatives when the merits of each alternative are not perfectly known. A natural rule is then to choose the alternative which “looks” best. We show that a version of the monotone likelihood ratio property is sufficient, and also essentially necessary, for this decision rule to be optimal. We also analyze how the precis...
متن کاملDenumerable Constrained Markov Decision Problems and Finite Approximations Denumerable Constrained Markov Decision Problems and Finite Approximations
The purpose of this paper is two fold. First to establish the Theory of discounted constrained Markov Decision Processes with a countable state and action spaces with general multi-chain structure. Second, to introduce nite approximation methods. We deene the occupation measures and obtain properties of the set of all achievable occupation measures under the diierent admissible policies. We est...
متن کاملConstrained Control Problems of Discrete Processes
In undergoing this life, many people always try to do and get the best. New knowledge, experience, lesson, and everything that can improve the life will be done. However, many people sometimes feel confused to get those things. Feeling the limited of experience and sources to be better is one of the lacks to own. However, there is a very simple thing that can be done. This is what your teacher ...
متن کاملDiscrete profile alignment via constrained information bottleneck
Amino acid profiles, which capture position-specific mutation probabilities, are a richer encoding of biological sequences than the individual sequences themselves. However, profile comparisons are much more computationally expensive than discrete symbol comparisons, making profiles impractical for many large datasets. Furthermore, because they are such a rich representation, profiles can be di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Review of Economic Studies
سال: 2019
ISSN: 0034-6527,1467-937X
DOI: 10.1093/restud/rdz011